Bits Through Queues
ثبت نشده
چکیده
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملOn service guarantees of fair-queueing schedulers in real systems
In most systems, fair-queueing packet schedulers are the algorithms of choice for providing bandwidth and delay guarantees. These guarantees are computed assuming that the scheduler is directly attached to the transmit unit with no interposed buffering, and, for timestamp-based schedulers, that the exact number of bits transmitted is known when timestamps need to be updated. Unfortunately, both...
متن کاملBits through queues
Consider the following simple communication channel model: an error-free bit pipe leading to a buffer modeled by a single-server queue whose “packets” or “customers” are single bits. If the service rate is p bits/sec, common wisdom would indicate that the Shannon capacity of this communication link is p bits/sec. As we show in this paper, that intuition is wrong: the answer is actually higher t...
متن کاملSOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملAnalysis of the Discrete - Time GI / Geom ( n ) / 1 / N Queue
Keywords-Discre tet ime, Finite buffer, Geometric, Queue, State dependent. 1. I N T R O D U C T I O N In recent years, there has been a growing interest in the analysis of discrete-time queues due to their applications in communica t ion systems and other related areas. This can be judged by the fact t ha t two books [1,2] have recently come out. Also, various special issues of some journals ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996